On the M/G/1 retrial queue subjected to breakdownsDJELLAB, Natalia V.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 4, pp 299-310, issn 0399-0559, 12 p.Article

APPROXIMATION ALGORITHMS FOR SCHEDULING PARALLEL JOBSJANSEN, Klaus; THOLE, Ralf.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3571-3615, issn 0097-5397, 45 p.Article

Inefficiency of equilibria for the machine covering game on uniform machinesZHIYI TAN; LONG WAN; QI ZHANG et al.Acta informatica. 2012, Vol 49, Num 6, pp 361-379, issn 0001-5903, 19 p.Article

SERVER SCHEDULING TO BALANCE PRIORITIES, FAIRNESS, AND AVERAGE QUALITY OF SERVICEBANSAL, Nikhil; PRUHS, Kirk R.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3311-3335, issn 0097-5397, 25 p.Article

Properties of optimal schedules in preemptive shop schedulingBAPTISTE, Ph; CARLIER, J; KONONOV, A et al.Discrete applied mathematics. 2011, Vol 159, Num 5, pp 272-280, issn 0166-218X, 9 p.Article

Online unit clustering : Variations on a themeEPSTEIN, Leah; LEVIN, Asaf; VAN STEE, Rob et al.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 85-96, issn 0304-3975, 12 p.Article

Small deviations, JIT sequencing and symmetric case of Fraenkel's conjectureBRAUNER, N; JOST, V.Discrete mathematics. 2008, Vol 308, Num 11, pp 2319-2324, issn 0012-365X, 6 p.Article

A SHORT NOTE ON AN ADVANCE IN ESTIMATING THE WORST-CASE PERFORMANCE RATIO OF THE MPS ALGORITHMPALETTA, Giuseppe; VOCATURO, Francesca.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2198-2203, issn 0895-4801, 6 p.Article

Equilibria for two parallel links: the strong price of anarchy versus the price of anarchyEPSTEIN, Leah.Acta informatica. 2010, Vol 47, Num 7-8, pp 375-389, issn 0001-5903, 15 p.Article

Private cloud for collaboration and e-Learning services: from IaaS to SaaSDOELITZSCHER, Frank; SULISTIO, Anthony; REICH, Christoph et al.Computing (Wien. Print). 2011, Vol 91, Num 1, pp 23-42, issn 0010-485X, 20 p.Article

Online scheduling with reassignment on two uniform machinesQIAN CAO; ZHAOHUI LIU.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2890-2898, issn 0304-3975, 9 p.Article

The maximum gain of increasing the number of preemptions in multiprocessor schedulingKLONOWSKA, Kamilla; LUNDBERG, Lars; LENNERSTAD, Hakan et al.Acta informatica. 2009, Vol 46, Num 4, pp 285-295, issn 0001-5903, 11 p.Article

Speed scaling with a solar cellBANSAL, Nikhil; CHAN, Ho-Leung; PRUHS, Kirk et al.Theoretical computer science. 2009, Vol 410, Num 45, pp 4400-4407, issn 0304-3975, 8 p.Conference Paper

Robotic cell scheduling with operational flexibilityAKTURK, M. Selim; GULTEKIN, Hakan; KARASAN, Oya Ekin et al.Discrete applied mathematics. 2005, Vol 145, Num 3, pp 334-348, issn 0166-218X, 15 p.Article

A note on a quadratic algorithm for the 2-cyclic robotic scheduling problemCHE, Ada; KATS, Vladimir; LEVNER, Eugene et al.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 5188-5190, issn 0304-3975, 3 p.Article

On the existence of sports schedules with multiple venuesIKEBE, Yoshiko T; TAMURA, Akihisa.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1694-1710, issn 0166-218X, 17 p.Article

The learning effect : Getting to the core of the problemJANIAK, Adam; RUDEK, Radoslaw.Information processing letters. 2007, Vol 103, Num 5, pp 183-187, issn 0020-0190, 5 p.Article

Quality of Control and Quality of Service in Mobile Robot Navigation : Artificial Intelligence in Robotics and ImagingPOZA-LUJAN, José-Luis; POSADAS-YAGÜE, Juan-Luis; SIMO-TEN, José-Enrique et al.International journal of imaging and robotics. 2014, Vol 12, Num 1, pp 90-105, 16 p.Conference Paper

PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical schedulingPHILIPPOU, Anna; LEE, Insup; SOKOLSKY, Oleg et al.Theoretical computer science. 2012, Vol 413, Num 1, pp 2-20, issn 0304-3975, 19 p.Article

A new fair scheduling algorithm for periodic tasks on multiprocessorsKIM, Heeheon; CHO, Yookun.Information processing letters. 2011, Vol 111, Num 7, pp 301-309, issn 0020-0190, 9 p.Article

A note on improving the performance of approximation algorithms for radiation therapyBIEDL, Therese; DUROCHER, Stephane; HOOS, Holger H et al.Information processing letters. 2011, Vol 111, Num 7, pp 326-333, issn 0020-0190, 8 p.Article

Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraintsYUMEI HUO; HAIRONG ZHAO.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1081-1091, issn 0304-3975, 11 p.Article

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problemBONOMO, Flavia; MATTIA, Sara; ORIOLO, Gianpaolo et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6261-6268, issn 0304-3975, 8 p.Article

Comments on Generalized rate monotonic schedulability bounds using relative period ratiosPARK, Moonju.Information processing letters. 2011, Vol 111, Num 7, pp 334-337, issn 0020-0190, 4 p.Article

Online and semi-online hierarchical scheduling for load balancing on uniform machinesHOU, Li-Ying; LIYING KANG.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1092-1098, issn 0304-3975, 7 p.Article